Comparative Study of SWST (Simple Weighted Spanning Tree) and EAST (Energy Aware Spanning Tree)
نویسندگان
چکیده
منابع مشابه
Factorizations of some weighted spanning tree enumerators
We give factorizations for weighted spanning tree enumerators of Cartesian products of complete graphs, keeping track of fine weights related to degree sequences and edge directions. Our methods combine Kirchhoff’s Matrix-Tree Theorem with the technique of identification of factors.
متن کاملWeighted Spanning Tree Constraint with Explanations
Minimum Spanning Trees (MSTs) are ubiquitous in optimization problems in networks. Even though fast algorithms exist to solve the MST problem, real world applications are usually subject to constraints that do not let us apply such methods directly. In these cases we confront a version of the MST called the “Weighted Spanning Tree” (WST) in which we look for a spanning tree in a graph that sati...
متن کاملThe Weighted Spanning Tree Constraint Revisited
The weighted spanning tree constraint, or wst-constraint, is defined on an edgeweighted graph G and a value K. It states that G admits a spanning tree with weight at most K [3, 4]. It can be applied to network design problems as well as routing problems, in which it serves as a relaxation. In this work, we assume that we can represent the mandatory and possible edges that can belong to a soluti...
متن کاملApproximating Spanning Tree with Weighted Inner Nodes
We consider a problem coming from practical applications: finding a minimum spanning tree with both edge weights and inner node (non-leaf node) weights. This problem is NP-complete even in the metric space. We present two polynomial time algorithms which achieve approximation factors of 2.35 ln n and 2(Hn − 1), respectively, where n is the number of nodes in the graph and Hn is the n-th Harmoni...
متن کاملSpanning Tree or Gossip for Aggregation: A Comparative Study
Distributed aggregation queries like average and sum can be implemented in several different paradigms including gossip and hierarchical approaches. In the literature, these two paradigms are routinely associated with stereotypes such as “trees are fragile and complicated” and “gossip is slow and expensive”. However, a closer look reveals that these statements are not backed up by thorough stud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Networked and Distributed Computing
سال: 2014
ISSN: 2211-7946
DOI: 10.2991/ijndc.2014.2.3.4